n, m:, f, x:Top. (f^n+m(x)) ~ (f^n(f^m(x))) 

latex

ProofTree

Definitions	t  T, s = t, , Top, , a < b, x:AB(x), x:A. B(x), , f o g, x.A(x), primrec(n;b;c), f(a), Type, {T}, s ~ t, P  Q, False, A, A  B, {x:A| B(x)} , SQType(T), #$n, n - m, n+m, |g|, S  T, f^n, i  j , -n, Void, b, ff, (i = j), , b, tt, x:A  B(x), P & Q, P  Q, x =a y, null(as), a < b, x f y, a < b, [d], p  q, p  q, p q, i <z j, i z j, Unit, left + right
Lemmas	eqtt to assert, eqff to assert, iff transitivity, assert of bnot, not functionality wrt iff, assert of eq int, eq int wf, bool wf, bnot wf, not wf, assert wf, ge wf, nat properties, nat ind tp, nat wf, guard wf, top wf